一种有监督的稀疏保持近邻嵌入算法

为充分利用样本的类别信息,提出一种有监督的稀疏保持近邻嵌入算法(SSNPE).该算法结合稀疏表示和保持近邻的思想,根据先验类标签信息保持局部邻域的固有几何关系.采用最小近邻分类器估算识别率,测试结果表明,在姿态、光照和表情变化的情况下,SSNPE都具有较高的识别率.     

稀疏矩阵向量乘的FPGA设计与实现

针对传统的通用处理器(GPP)平台上执行稀疏矩阵向量乘计算效率低的问题,提出一种基于可重构计算平台的SpMXV协处理器设计。方案采用二叉树结构高度流水的数据流、IEEE-754的32 bit浮点数数据格式和对角存储格式。数据通路以流水线方式进行组织,能够优化计算性能。仿真结果表明,与GPP平台上的软件实现相比,通过硬件实现的设计能达到最高2.69倍的性能加速。     

改进的Koblitz曲线上数字签名算法

标量乘法的效率决定着椭圆曲线密码体制的性能,而JSF算法是当前最流行的计算椭圆曲线双标量乘的算法;Koblitz曲线上的快速标量乘算法是标量乘法研究的重要课题。Lee[12]算法采用Frobenius映射扩展正整数k并将其扩展后的系数改写成二进制形式有效地提高标量乘算法效率。将JSF应用到扩展后的系数中,以较小存储空间为代价来提高算法效率,并将算法运用到改进的ECDSA算法中,减少乘法运算次数,加速签名及验证过程,节约数字签名时间。     

高阶张量信号的稀疏表示

为了有效地压缩多线性信号,提出了高阶张量信号的稀疏表示框架。基于提出的张量信号的稀疏性度量准则,建立了张量信号稀疏表示的模型。并对于所建立的模型,设计了交替式求解方法。在交替式方法中,先将每个优化问题分解为若干个有次序的非凸子优化问题,再利用组织进化算法来求解这些子优化问题。实验结果表明,当交替式方法运行信号的阶数次时,模型的解已非常接近平稳点,同时有效地获得了信号的稀疏表示。     

压缩传感综述

在传统采样过程中, 为了避免信号失真, 采样频率不得低于信号最高频率的2倍. 然而对于数字图像、视频的获取, 依照香农(Shannon)定理会导致海量采样数据, 大大增加了存储和传输的代价. 近年来, 一种新兴的压缩传感理论为数据采集技术带来了革命性的突破, 得到了研究人员的广泛关注. 压缩传感采用非自适应线性投影来保持信号的原始结构, 能通过数值最优化问题准确重构原始信号. 压缩传感以远低于奈奎斯特频率进行采样, 在压缩成像系统、模拟/信息转换、生物传感等领域有着广阔的应用前景. 本文主要介绍了压缩传感的基本理论及相关应用, 并对其研究前景进行了展望.     

基于稀疏性非负矩阵分解和支持向量机的时频图像识别

针对机械故障诊断领域对反映设备运行状态的图像识别困难以及选择和提取敏感特征困难的问题, 将基于图像的机械设备运行状态判别问题当作图像的识别问题来处理, 提出使用稀疏性非负矩阵分解(Sparse non-negative matrix factorization, SNMF)和支持向量机(Support vector machine, SVM)对时频图像进行识别进而判断机器运行状态, 从而避免特征的选择和提取. 稀疏性非负矩阵分解在对时频图像进行大规模压缩的同时, 能够很好地保留图像的隐含特征, 从而大大减少自动识别时频图像的计算复杂度, 并有效地提高支持向量机的识别精度. 此外, 本文还对影响识别率的稀疏性非负矩阵分解的各参数进行了讨论. 实验结果表明, 该方法对时频处理方法依赖性低, 在大多数情况下都能获得较传统方法高的识别率.     

激光测速雷达射频前端仿真设计

根据相干激光测速雷达系统对信号采集前端的要求,确定了适用于激光测速雷达系统的射频前端系统,并采用自顶向下的设计方法,借助Agilent公司的ADS2008软件,设计了中心频率为55 MHz,工作带宽为22 MHz,增益在50 dB以上,噪声小于2 dB的射频前端,重点对低噪声放大器(LNA)、抗混叠滤波器和自动增益控制系统(AGC)进行了设计、仿真及优化。     

Experience with an extensible workspace for analysis of low‐level usage data

Analysis of low‐level usage data collected in empirical studies of user interaction is well known as a demanding task. Existing techniques for data collection and analysis are either application specific or data‐driven. This paper presents a workspace for data cleaning, transformation and analysis of low‐level usage data that we have developed and reports our experience with it. By its five‐level architecture, the workspace makes a distinction between more general data that typically can be used in initial data analysis and the data answering a specific research question. The workspace was used in four studies and in total 6.5M user actions were collected from 238 participants. The collected data have been proven to be useful for: (i) validating solution times, (ii) validating process conformances, (iii) exploratory studies on program comprehension for understanding use of classes and documents and (iv) testing hypotheses on keystroke latencies. We have found workspace creation to be demanding in time. Particularly demanding were determining the context of actions and dealing with deficiencies. However, once these processes were understood, it was easy to reuse the workspace for different experiments and to extend it to answer new research questions. Based on our experience, we give a set of guidelines that might help in setting up studies, collecting and preparing data. We recommend that designers of data collection instruments add context to each action. Furthermore, we recommend rapid iterations starting early in the process of data preparation and analysis, and covering both general and specific data. Copyright © 2009 John Wiley & Sons, Ltd.     

Semisimple algebras of almost minimal rank over the reals

A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are called algebras of minimal rank. After 25 years of research, these algebras are now well understood. Here we start the investigation of the algebras for which the Alder–Strassen bound is off by one. As a first result, we completely characterize the semisimple algebras over R$\mathbb{R}$ whose bilinear complexity is by one larger than the Alder–Strassen bound. Furthermore, we characterize all algebras A$A$ (with radical) of minimal rank plus one over R$\mathbb{R}$ for which A/radA$A/radA$ has minimal rank plus one. The other possibility is that A/radA$A/radA$ has minimal rank. For this case, we only present a partial result.